Threshold data structures and coding theory

Threshold data structures and coding theory

Data structures for combinatorial objects are traditionally designed to handle objects up to a certain size. We introduce the idea of threshold data structures: representations that allow a richer collection of operations on small objects than large ones. As illustrations of the general concept we discuss threshold data structures for sets and multisets, and show how the former can be applied t...

Data structures, coding and classification.

Deterministic Threshold Queries of Distributed Data Structures

Convergent replicated data types, or CvRDTs, are latticebased data structures for enforcing the eventual consistency of replicated objects in a distributed system. Although CvRDTs are provably eventually consistent, queries of CvRDTs nevertheless allow inconsistent intermediate states of replicas to be observed; and although in practice, many systems allow a mix of eventually consistent and str...

Joint Data Hiding and Wyner-Ziv Coding, Theory and Practice

This paper considers the joint problem of dirty-paper and Wyner-Ziv coding with partial host information at the receiver. The rate-distortion and the capacity expressions have been derived for the Gaussian case. It is shown that the availability of the partial host information to the receiver has positive effects to the compression performance and the overall capacity. Moreover, a practical cod...

Network Coding Theory Network Coding Theory

All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. For those organizations that have been granted a photocopy license, a separate system of payment has been arranged. Authorization does not extend to othe...